Bichromatic compatible matchings

For a set R of n red points and a set B of n blue points, a BR-matching is a non-crossing geometric perfect matching where each segment has one endpoint in B and one in R. Two BR-matchings are compatible if their union is also non-crossing. We prove that, for any two distinct BR-matchings M and M′, there exists a sequence of BR-matchings M = M1, Mk =M′ such that Mi-1 is compatible with Mi. This implies the connectivity of the compatible bichromatic matching graph containing one node for each BR-matching and an edge joining each pair of compatible BR-matchings, thereby answering the open problem posed by Aichholzer et al. in [1].SCOPUS: ar.jinfo:eu-repo/semantics/publishe

Isoperimetric Enclosures

Given a number P, we study the following three isoperimetric problems introduced by Besicovitch in 1952: (1) LetS be a set of n points in the plane. Among all the curves with perimeter P that enclose S, what is the curve that encloses the maximum area? (2) Let Q be a convex polygon with n vertices. Among all the curves with perimeter P contained in Q, what is the curve that encloses the maximum area? (3) Let (Formula presented.) be a positive number. Among all the curves with perimeter P and circumradius (Formula presented.), what is the curve that encloses the maximum area? In this paper, we provide a complete characterization for the solutions to Problems 1, 2 and 3. We show that there are cases where the solution to Problem 1 cannot be computed exactly. However, it is possible to compute in (Formula presented.) time the exact combinatorial structure of the solution. In addition, we show how to compute an approximation of this solution with arbitrary precision. For Problem 2, we provide an (Formula presented.)-time algorithm to compute its solution exactly. In the case of Problem 3, we show that the problem can be solved in constant time. As a side note, we show that if S is a set of n points in the plane, then finding the area of the curve of perimeter P that encloses S and has minimum area is NP-hard.SCOPUS: ar.jinfo:eu-repo/semantics/publishe